Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
661	Incremental List Coloring of Graphs, Parameterized by ConservationI Sepp Hartunga , Rolf Niedermeiera a Institut f¨ Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-01-22 17:08:40 Graph coloring NP-complete problems List coloring Parameterized complexity Kernelization Vertex cover Independent set Edge coloring Complete coloring Graph theory Theoretical computer science Mathematics
662	Constant Thresholds Can Make Target Set Selection Tractable? Morgan Chopin1?? , Andr´e Nichterlein2 , Rolf Niedermeier2 , and Mathias Weller2? ? ? 1 Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-09-21 09:31:02 Graph operations Path decomposition Clique Kernelization Vertex cover Parameterized complexity Tree decomposition Feedback vertex set Dominating set Graph theory Theoretical computer science NP-complete problems
663	Irene Moulitsas and George Karypis University of Minnesota, Department of Computer Science / Army HPC Research Center Minneapolis, MN 55455 moulitsa, karypis @cs.umn.edu Add to Reading List Source URL: www-users.cs.umn.edu Language: English - Date: 2001-12-10 13:46:18 Mesh generation NP-complete problems Multigrid method Numerical analysis Wavelets Graph partition Unstructured grid Regular grid Biconnected component Mathematics Theoretical computer science Graph theory
664	Editors’ Introduction Sanjay Jain, R´emi Munos, Frank Stephan, and Thomas Zeugmann The aim of the series of conferences on Algorithmic Learning Theory (ALT) is to look at learning from algorithmic and mathematical per Add to Reading List Source URL: www-alg.ist.hokudai.ac.jp Language: English - Date: 2014-03-14 14:24:08 Artificial intelligence Theoretical computer science Learning Probably approximately correct learning Inductive inference Active learning Algorithm Reinforcement learning Book:Machine Learning - The Complete Guide Machine learning Computational learning theory Applied mathematics
665	Chicago Journal of Theoretical Computer Science The MIT Press Volume 1999, Article 11 Satisfiability Coding Lemma ISSN 1073–0486. MIT Press Journals, Five Cambridge Center, Cambridge, Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2000-02-20 22:53:43 NP-complete problems Conjunctive normal form Combinatorics Boolean satisfiability problem String Permutation PP 2-satisfiability MAX-3SAT Theoretical computer science Mathematics Computational complexity theory
666	Progress Report Generated: November 5, 2002 I am now able to do complete “run” efficiently. I build the F ring with a specified pair of parameters: h0 setting the shape of the profile of optical depth with height, an Add to Reading List Source URL: www.astro.cornell.edu Language: English - Date: 2002-11-05 16:25:04 Cycloalkane Structure Ring theory Ring Ansa
667	Evaluation of ILP-based Approaches for Partitioning into Colorful Components Sharon Bruckner1? , Falk H¨ uffner2?? , Christian Komusiewicz2 , and Rolf Niedermeier2 1 Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-03-13 14:59:55 NP-complete problems Graph partition Clique Graph coloring Vertex Connected component Breadth-first search Connectivity Tree Graph theory Theoretical computer science Mathematics
668	The Parameterized Complexity of the Rainbow Subgraph Problem Falk Hüffner? , Christian Komusiewicz?? , Rolf Niedermeier, and Martin Rötzschke Institut für Softwaretechnik und Theoretische Informatik, TU Berlin, German Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-07-31 12:35:33 NP-complete problems Graph coloring Degeneracy Vertex cover Edge coloring Clique Vertex Graph Dense subgraph Graph theory Theoretical computer science Mathematics
669	A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems? Vincent Froese, Ren´e van Bevern, Rolf Niedermeier, and Manuel Sorge Institut f¨ ur Softwaretechnik und Theoretische Informatik, TU Berli Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-06-19 10:42:56 Complexity classes Mathematical optimization Structural complexity theory NP-complete problems Parameterized complexity NP-complete P versus NP problem NP FO Theoretical computer science Computational complexity theory Applied mathematics
670	1 Efficient Reasoning about Data Trees via Integer Linear Programming CLAIRE DAVID, Universit´e Paris-Est LEONID LIBKIN, University of Edinburgh TONY TAN, University of Edinburgh Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2012-04-27 14:06:25 Electronic design automation Formal methods Logic in computer science NP-complete problems Complexity classes Satisfiability Modulo Theories Symbol Boolean satisfiability problem P-complete Theoretical computer science Computational complexity theory Applied mathematics

UPDATE